Lower complexity bounds for interpolation algorithms
نویسندگان
چکیده
منابع مشابه
Lower complexity bounds for interpolation algorithms
We introduce and discuss a new computational model for Hermite–Lagrange interpolation by nonlinear classes of polynomial interpolants. We distinguish between an interpolation problem and an algorithm that solves it. Our model includes also coalescence phenomena and captures a large variety of known Lagrange-Hermite interpolation problems and algorithms. Like in traditional Hermite–Lagrange inte...
متن کاملConnecting SAT Algorithms and Complexity Lower Bounds
I will describe prior and current work on connecting the art of finding good satisfiability algorithms with the art of proving complexity lower bounds: proofs of limitations on what problems can be solved by good algorithms. Surprisingly, even minor algorithmic progress on solving the circuit satisfiability problem faster than exhaustive search can be applied to prove strong circuit complexity ...
متن کاملMessage Complexity Lower Bounds for Decentralized Anonymous Wave Algorithms
We prove an (DjEj) lower bound on the message complexity of decentralized anonymous wave algorithms for the unidirectional ring, the hypercube and the clique. Here D is the diameter and E the number of edges of the network. This proves that the Phase algorithm is optimal for them, and suggests that it is an optimal decentralized anonymous wave algorithm over arbitrary networks.
متن کاملLower Bounds by Birkhoff Interpolation
In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such a representation must be at least of order d. This is clearly optimal up to a constant factor. Previous lower bounds for this problem were only of order Ω( √...
متن کاملAlgorithms and lower bounds in finite automata size complexity
In this thesis we investigate the relative succinctness of several types of finite automata, focusing mainly on the following four basic models: one-way deterministic (1dfas), one-way nondeterministic (1nfas), two-way deterministic (2dfas), and two-way nondeterministic (2nfas). We first establish the exact values of the trade-offs for all conversions from two-way to one-way automata. Specifical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2011
ISSN: 0885-064X
DOI: 10.1016/j.jco.2010.10.003